Kernels on Prolog Ground Terms
نویسندگان
چکیده
We describe a family of kernels over untyped and typed Prolog ground terms and show that they can be applied for learning in structured domains, presenting experimental results in a QSPR task.
منابع مشابه
Interning Ground Terms in XSB
This paper presents an implementation of interning of ground terms in the XSB Tabled Prolog system. This is related to the idea of “hash-consing”. I describe the concept of interning atoms and discuss the issues around interning ground structured terms, motivating why tabling Prolog systems may change the cost-benefit tradeoffs from those of traditional Prolog systems. I describe the details of...
متن کاملkProlog: an algebraic Prolog for kernel programming
kProlog is a simple algebraic extension of Prolog with facts and rules annotated with semiring labels. We propose kProlog as a language for learning with kernels. kProlog allows to elegantly specify systems of algebraic expressions on databases. We propose some code examples of gradually increasing complexity, we give a declarative specification of some matrix operations and an algorithm to sol...
متن کاملLearning with Kernels and Logical Representations
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background knowledge are used to form a kernel function, enabling us to subsequently apply a number of kernel-based statistical learning algorithms. Different representational frameworks and associated algorithms are explored i...
متن کاملOptimizations of Bottom - Up Eval
Memoization, such as that performed by bottom-up evaluation, helps detect loops, avoid repeated computation when subgoals are generated repeatedly, and in conjunction with a fair search strategy, ensures that evaluation is complete. Programs that generate non-ground facts (i.e., facts containing universally quantiied variables) and also need memoization are important in several contexts. Curren...
متن کاملType Inference in Prolog and Its Application
In this paper we present a type inference method for Prolog programs. The new idea is to describe a superset of the success set by associating a type substitution (an assignment of sets of ground terms to variables) with each head of definite clause. This approach not only conforms to the style of definition inherent to Prolog but also gives some accuracy to the types infered. We show the basic...
متن کامل